Gaudry's Variant against Cab Curves

نویسنده

  • Seigo Arita
چکیده

Gaudry has described a new algorithm (Gaudry’s variant) for the discrete logarithm problem (DLP) in hyperelliptic curves. For a hyperelliptic curve of a small genus on a finite field GF(q), Gaudry’s variant solves for the DLP in time O(q2+2). This paper shows that Cab curves can be attacked with a modified form of Gaudry’s variant and presents the timing results of such attack. However, Gaudry’s variant cannot be effective in all of the Cab curve cryptosystems. This paper also provides an example of a Cab curve that is unassailable by Gaudry’s variant. key words: discrete logarithm, hyperelliptic curve, superelliptic curve, Cab curve

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An addition algorithm in Jacobian of Cab curves

Nowadays, elliptic curve cryptosystems receive attention and much effort is being dedicated to make it more and more practical. It is worthwhile to construct discrete logarithm based cryptosystems using more general algebraic curves, because it supplies more security sources for public key cryptosystems. The presented paper introduces Cab curves. Roughly speaking, a curve is Cab if it is non-si...

متن کامل

Conceptor-aided Backpropagation

Catastrophic interference has been a major roadblock in the research of continual learning. Here we propose a variant of the back-propagation algorithm, “conceptor-aided backprop” (CAB), in which gradients are shielded by conceptors against degradation of previously learned tasks. Conceptors have their origin in reservoir computing, where they have been previously shown to overcome catastrophic...

متن کامل

Overcoming Catastrophic Interference by Conceptors

Catastrophic interference has been a major roadblock in the research of continual learning. Here we propose a variant of the back-propagation algorithm, “conceptor-aided back-prop” (CAB), in which gradients are shielded by conceptors against degradation of previously learned tasks. Conceptors have their origin in reservoir computing, where they have been previously shown to overcome catastrophi...

متن کامل

Klein’s Fundamental 2-Form of Second Kind for the Cab Curves

Abstract. In this paper, we derive the exact formula of Klein’s fundamental 2-form of second kind for the so-called Cab curves. The problem was initially solved by Klein in the 19th century for the hyper-elliptic curves, but little progress had been seen for its extension for more than 100 years. Recently, it has been addressed by several authors, and was solved for subclasses of the Cab curves...

متن کامل

A GEOMETRIC INTERPRETATION OF REDUCTION IN THE JACOBIANS OF Cab CURVES by

— In this paper, we show that the reduction of divisors in the Jacobian of a curve C can be performed by considering the intersections of a suitable projective model of C with quadrics in projective space. We apply this idea to certain projective model of elliptic and hyperelliptic curves on one hand, and to the canonical model of Cab curves on the other hand, and we find well known algorithms....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000